Spectral estimation of the percolation transition in clustered networks
نویسنده
چکیده
There have been several spectral bounds for the percolation transition in networks, using spectrum of matrices associated with the network such as the adjacency matrix and the nonbacktracking matrix. However, they are far from being tight when the network is sparse and displays clustering or transitivity, which is represented by existence of short loops, e.g., triangles. In this paper, for the bond percolation, we first propose a message-passing algorithm for calculating size of percolating clusters considering effects of triangles, then relate the percolation transition to the leading eigenvalue of a matrix that we name the triangle-nonbacktracking matrix, by analyzing stability of the message-passing equations. We establish that our method gives a tighter lower bound to the bond percolation transition than previous spectral bounds, and it becomes exact for an infinite network with no loops longer than 3. We evaluate numerically our methods on synthetic and real-world networks, and discuss further generalizations of our approach to include higher-order substructures.
منابع مشابه
Double percolation phase transition in clustered complex networks
We perform an extensive numerical study of the effects of clustering on the structural properties of complex networks. We observe that strong clustering in heterogeneous networks induces the emergence of a core-periphery organization that has a critical effect on their percolation properties. In such situation, we observe a novel double phase transition, with an intermediate phase where only th...
متن کاملPercolation and epidemics in random clustered networks.
The social networks that infectious diseases spread along are typically clustered. Because of the close relation between percolation and epidemic spread, the behavior of percolation in such networks gives insight into infectious disease dynamics. A number of authors have studied percolation or epidemics in clustered networks, but the networks often contain preferential contacts in high degree n...
متن کاملPercolation in clustered networks
The social networks that infectious diseases spread along are typically clustered. Because of the close relation between percolation and epidemic spread, the behavior of percolation in such networks gives insight into infectious disease dynamics. A number of authors have studied clustered networks, but the networks often contain preferential mixing between high degree nodes. We introduce a clas...
متن کاملPhase Transitions for Information Spreading in Random Clustered Networks with Arbitrary Contact Rates
Information spreading plays an essential role in numerous human interactions, including the diffusion of innovations, rumors, fads, and epidemics. Phase transitions for information spreading have been observed in many complex systems, such as social, economic, and biological systems [2,6]. That is, there exists a tipping point at which information suddenly spreads rapidly and globally so that t...
متن کاملPercolation and epidemic thresholds in clustered networks.
We develop a theoretical approach to percolation in random clustered networks. We find that, although clustering in scale-free networks can strongly affect some percolation properties, such as the size and the resilience of the giant connected component, it cannot restore a finite percolation threshold. In turn, this implies the absence of an epidemic threshold in this class of networks, thus e...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Physical review. E
دوره 96 4-1 شماره
صفحات -
تاریخ انتشار 2017